package bTree.LeetCode;

public class 编辑距离 {
    public int minDistance(String word1, String word2) {
        int length1 = word1.length();
        int length2 = word2.length();
        int [][]dp=new int[length1+1][length2+1];
        for (int i = 0; i <= length2; i++) {
            dp[0][i]=i;
        }
        for (int i = 0; i <= length1; i++) {
            dp[i][0]=i;
        }
        for(int i=1;i<=length1;i++){
            for(int j=1;j<=length2;j++){
                if(word1.charAt(i-1)==word2.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1];
                }else {
                    int min = Math.min(dp[i - 1][j]+1, dp[i][j - 1]+1);
                    int min1 = Math.min(min, dp[i - 1][j - 1] + 1);
                    dp[i][j]=min1;
                }
            }
        }
        return dp[length1][length2];
    }
}